Learning Regular Omega Languages
نویسندگان
چکیده
We provide an algorithm for learning an unknown regular set of infinite words, using membership and equivalence queries. Three variations of the algorithm learn three different canonical representations of omega regular languages, using the notion of families of dfas. One is of size similar to L$, a dfa representation recently learned using L ∗ [7]. The second is based on the syntactic forc, introduced in [14]. The third is introduced herein. We show that the second can be exponentially smaller than the first, and the third is at most as large as the first two, with up to a quadratic saving with respect to the second.
منابع مشابه
Extending Automated Compositional Verification to the Full Class of Omega-Regular Languages
Recent studies have suggested the applicability of learning to automated compositional verification. However, current learning algorithms fall short when it comes to learning liveness properties. We extend the automaton synthesis paradigm for the infinitary languages by presenting an algorithm to learn an arbitrary regular set of infinite sequences (an ω-regular language) over an alphabet Σ. Ou...
متن کاملQuery Learning of Derived Omega-Tree Languages in Polynomial Time
We present the first polynomial time algorithm to learn nontrivial classes of languages of infinite trees. Specifically, our algorithm uses membership and equivalence queries to learn classes of ω-tree languages derived from weak regular ω-word languages in polynomial time. The method is a general polynomial time reduction of learning a class of derived ω-tree languages to learning the underlyi...
متن کاملFamilies of DFAs as Acceptors of omega-Regular Languages
Families of dfas (fdfas) provide an alternative formalism for recognizing ωregular languages. The motivation for introducing them was a desired correlation between the automaton states and right congruence relations, in a manner similar to the MyhillNerode theorem for regular languages. This correlation is beneficial for learning algorithms, and indeed it was recently shown that ω-regular langu...
متن کاملOmega Algebras and Regular Equations
We study a weak variant of omega algebra, where one of the usual star induction axioms is absent, in the context of recursive regular equations. We present abstract conditions for explicitly defining the omega operation and use them for proving an algebraic variant of Arden’s rule for solving such equations. We instantiate these results in concrete models—languages, traces and relations—showing...
متن کاملClassifying regular languages by a split game
In this paper, we introduce a variant of the Ehrenfeucht-Fräıssé game from logic which is useful for analyzing the expressive power of classes of generalized regular expressions. An extension of the game to generalized ω-regular expressions is also established. To gain insight into how the game can be applied to attack the long-standing generalized star height 2 problem, we propose and solve a ...
متن کامل